A Computational Evaluation of Case-Assignment Algorithms
نویسندگان
چکیده
This project seeks to evaluate how successfully a new theory based on syntactic structure models the distribution of morphological case in Icelandic. This algorithm for case assignment will be tested against a traditional, grammatical-function-based theory on a large number of sentences from a corpus. Morphological case is a noun’s syntactic license to appear in its environment based on dependencies with other constituents, expressed as morphology on the noun. Traditionally, it has been held that case on a noun phrase corresponds to a grammatical function. This correspondence induces an algorithm for assigning case to a noun in a syntactic tree, based on its function. This account, however, has failed to account for the distribution of cases observed in Icelandic. A new theory, based on the structural relations of heads rather than grammatical functions, has been devised to model the Icelandic irregularities while still correctly predicting the cross-linguistic data that appears to be function-based. The theory claims that case is assigned based on lexical properties of heads and syntactic relations among constituents. While its algorithm for assigning case has been well motivated in theory and has succeeded on isolated examples, it has not been widely studied on large quantities of data. This new structure-based algorithm is operationalized as a computer program and compared to the function-based one. Each algorithm is applied to syntax trees from a tree bank of over a million words. Disregarding the cases listed in the tree bank, the program marks the nouns in the trees for case (according to the algorithm at hand) and compares its assignment against the attested case in the corpus. Along the way, it keeps track of how many nouns the given algorithm has marked correctly. The relative scores of each algorithm will answer the question of how successful as a theory of case distribution the structural theory is compared to the traditional account.
منابع مشابه
Gradient-based Ant Colony Optimization for Continuous Spaces
A novel version of Ant Colony Optimization (ACO) algorithms for solving continuous space problems is presented in this paper. The basic structure and concepts of the originally reported ACO are preserved and adaptation of the algorithm to the case of continuous space is implemented within the general framework. The stigmergic communication is simulated through considering certain direction vect...
متن کاملGradient-based Ant Colony Optimization for Continuous Spaces
A novel version of Ant Colony Optimization (ACO) algorithms for solving continuous space problems is presented in this paper. The basic structure and concepts of the originally reported ACO are preserved and adaptation of the algorithm to the case of continuous space is implemented within the general framework. The stigmergic communication is simulated through considering certain direction vect...
متن کاملKinetic Mechanism Reduction Using Genetic Algorithms, Case Study on H2/O2 Reaction
For large and complex reacting systems, computational efficiency becomes a critical issue in process simulation, optimization and model-based control. Mechanism simplification is often a necessity to improve computational speed. We present a novel approach to simplification of reaction networks that formulates the model reduction problem as an optimization problem and solves it using geneti...
متن کاملA new multi-objective model for berth allocation and quay crane assignment problem with speed optimization and air emission considerations (A case study of Rajaee Port in Iran)
Over the past two decades, maritime transportation and container traffic worldwide has experienced rapid and continuous growth. With the increase in maritime transportation volume, the issue of greenhouse gas (GHG) emission has become one of the new concerns for port managers. Port managers and government agencies for sustainable development of maritime transportation considered "green ports" t...
متن کاملHealthcare Districting Optimization Using Gray Wolf Optimizer and Ant Lion Optimizer Algorithms (case study: South Khorasan Healthcare System in Iran)
In this paper, the problem of population districting in the health system of South Khorasan province has been investigated in the form of an optimization problem. Now that the districting problem is considered as a strategic matter, it is vital to obtain efficient solutions in order to implement in the system. Therefore in this study two meta-heuristic algorithms, Ant Lion Optimizer (ALO) and G...
متن کاملPerformance evaluation of block-based copy- move image forgery detection algorithms
Copy-move forgery is a particular type of distortion where a part or portions of one image is/are copied to other parts of the same image. This type of manipulation is done to hide a particular part of the image or to copy one or more objects into the same image. There are several methods for detecting copy-move forgery, including block-based and key point-based methods. In this paper, a method...
متن کامل